翻訳と辞書 Words near each other ・ Bicknell Museum ・ Bicknell v. Comstock ・ Bicknell's thrush ・ Bicknell, Indiana ・ Bicknell, Utah ・ Bicknell-Armington Lightning Splitter House ・ Bicknoller ・ Bicknor ・ Bickram Ghosh ・ Bickton ・ Bicky Chakraborty ・ Bickë ・ Biclavigera ・ Biclavula ・ Biclique attack ・ Biclique-free graph ・ Biclonuncaria ・ Biclonuncaria alota ・ Biclonuncaria cerucha ・ Biclonuncaria coniata ・ Biclonuncaria conica ・ Biclonuncaria dalbergiae ・ Biclonuncaria deutera ・ Biclonuncaria foeda ・ Biclonuncaria juanita ・ Biclonuncaria parvuncus ・ Biclonuncaria phaedroptera ・ Biclonuncaria residua ・ Biclonuncaria tetrica ・ Biclotymol Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Biclique-free graph ： ウィキペディア英語版 Biclique-free graph In graph theory, a branch of mathematics, a -biclique-free graph is a graph that has no 2-vertex complete bipartite graph as a subgraph. A family of graphs is biclique-free if there exists a number such that the graphs in the family are all -biclique-free. The biclique-free graph families form one of the most general types of sparse graph family. They arise in incidence problems in discrete geometry, and have also been used in parameterized complexity. ==Properties== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Biclique-free graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.